Modular Inverse Algorithms Without Multiplications for Cryptographic Applications

نویسنده

  • Laszlo Hars
چکیده

Hardware and algorithmic optimization techniques are presented to the left-shift, right-shift, and the traditional Euclideanmodular inverse algorithms. Theoretical arguments and extensive simulations determined the resulting expected running time. On many computational platforms these turn out to be the fastest known algorithms for moderate operand lengths. They are based on variants of Euclidean-type extended GCD algorithms. On the considered computational platforms for operand lengths used in cryptography, the fastest presented modular inverse algorithms need about twice the time of modular multiplications, or even less. Consequently, in elliptic curve cryptography delaying modular divisions is slower (affine coordinates are the best) and the RSA and ElGamal cryptosystems can be accelerated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols

Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called the Enhanced Euclid Algorithm, for modular multiplicative inverse (MMI). Analysis of the proposed algorithm shows that it is more efficient than the Extended Euclid algorithm (XEA). In addition, if a MMI doe...

متن کامل

Long Modular Multiplication for Cryptographic Applications

A digit-serial, multiplier-accumulator based cryptographic coprocessor architecture is proposed, similar to fix-point DSP's with enhancements, supporting long modular arithmetic and general computations. Several new “column-sum” variants of popular quadratic time modular multiplication algorithms are presented (Montgomery and interleaved division-reduction with or without Quisquater scaling), w...

متن کامل

Efficient Modular Arithmetic for SIMD Devices

This paper describes several new improvements of modular arithmetic and how to exploit them in order to gain more efficient implementations of commonly used algorithms, especially in cryptographic applications. We further present a new record for modular multiplications per second on a single desktop computer as well as a new record for the ECM factoring algorithm. This new results allow buildi...

متن کامل

An Abstract of the Thesis of High-speed Algorithms & Architectures for Number-theoretic Cryptosystems

approved: C etin K. Ko c Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are often desired because of their exibility and cost e ectiveness. In this study, we concentrate on developing high-speed and area-e cient modular multiplication and exponentiati...

متن کامل

Applications of Fast Truncated Multiplication in Embedded Cryptography

Truncated Multiplications compute Truncated Products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(n), with 1< α ≤ 2, there is a truncated multiplication algorithm, which is constant times faster when computing a short enough truncated product. Applying these fast truncated multiplications several cryptographic long inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • EURASIP J. Emb. Sys.

دوره 2006  شماره 

صفحات  -

تاریخ انتشار 2006